A Product of Integer Partitions
نویسنده
چکیده
I present a bijection on integer partitions that leads to recursive expressions, closed formulae and generating functions for the cardinality of certain sets of partitions of a positive integer n. The bijection leads also to a product on partitions that is associative with a natural grading thus defining a free associative algebra on the set of integer partitions. As an outcome of the computations, certain sets of integers appear that I call difference sets and the product of the integers in a difference set is an invariant for a family of sets of partitions. The main combinatorial objects used in these constructions are the central hooks of the Ferrers diagrams of partitions.
منابع مشابه
Stirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملMaximum Product Over Partitions Into Distinct Parts
We establish an explicit formula for the maximum value of the product of parts for partitions of a positive integer into distinct parts (sequence A034893 in the On-Line Encyclopedia of Integer Sequences).
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملOn the Set of Reduced Φ-partitions of a Positive Integer∗
Given a positive integer n, the sum n = a1 + · · ·+ ai with 1 ≤ a1 ≤ a2 ≤ · · · ≤ ai ∈ N is called a φ-partition if it satisfies φ(n) = φ(a1)+ · · ·+φ(ai), where φ is Euler’s totient function. And, a φ-partition is reduced if each of its summands is simple, where a simple number is known as 1 or a product of the first primes. In this note we will present a new algorithm to exhaust the set of al...
متن کاملMaximum Part-Products of Odd Palindromic Compositions
We derive explicit formulas for the maximum part-product over the set of palindromic compositions of a given integer and over the set of palindromic compositions of a given integer with only odd parts. These results are extensions of the well-known elementary formula for the maximum part-product over the set of classical partitions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009